Reflections on a Problem of Erdős and Hajnal
نویسنده
چکیده
The problem I am going to comment reached me in 1987 at Memphis in a letter of Uncle Paul. He wrote: 'We have the following problem with Hajnal. If G(n) has n points and does not contain induced C4, is it true that it has either a clique or an independent set with n 10 points? Kind regards to your boss+ colleagues, kisses to the E -s.' E.P.' After noting that E have been used in different contexts I realized soon that ~ is a good E (in both senses since I have three daughters). About a month later Paul arrived and said he meant Cs for C4. And this minor change of subscript gave a problem still unsolved. And this is just a special case of the general problem formulated in the next paragraph.
منابع مشابه
Reflections on Paul Erdős on His Birth Centenary, Part II
This is Part II of the two-part feature on Paul Erdős following his centennial. Part I had contributions from Krishnaswami Alladi and Steven G. Krantz, Vera T. Sós and László Lovász, Ronald Graham and Joel Spencer, Jean-Pierre Kahane, and Mel Nathanson. Here in Part II we have six articles from contributors Noga Alon, Dan Goldston, András Sárközy, József Szabados, Gérald Tenenbaum, and Stephan ...
متن کاملThe Erdös-Hajnal conjecture for bull-free graphs
The bull is a graph consisting of a triangle and two pendant edges. A graphs is called bull-free if no induced subgraph of it is a bull. In this paper we prove that every bull-free graph on n vertices contains either a clique or a stable set of size n 1 4 , thus settling the Erdős-Hajnal conjecture [5] for the bull.
متن کاملThe Erd\H{o}s-Hajnal conjecture for caterpillars and their complements
The celebrated Erdős-Hajnal conjecture states that for every proper hereditary graph class G there exists a constant ε = ε(G) > 0 such that every graph G ∈ G contains a clique or an independent set of size |V (G)|. Recently, there has been a growing interest in the symmetrized variant of this conjecture, where one additionally requires G to be closed under complementation. We show that any here...
متن کاملUpper Bounds for Erdös-Hajnal Coefficients of Tournaments
A version of the Erdős-Hajnal conjecture for tournaments states that for every tournament H every tournament T that does not contain H as a subtournament, contains a transitive subtournament of size at least n (H) for some (H) > 0, where n is the order of T . For any fixed tournament H we can denote by n0(H) the supremum over all ≥ 0 satisfying the following statement: every tournament T of ord...
متن کاملThe Erdős-Hajnal conjecture for caterpillars and their complements
The celebrated Erdős-Hajnal conjecture states that for every proper hereditary graph class G there exists a constant ε = ε(G) > 0 such that every graph G ∈ G contains a clique or an independent set of size |V (G)|. Recently, there has been a growing interest in the symmetrized variant of this conjecture, where one additionally requires G to be closed under complementation. We show that any here...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013